Network iso-elasticity and weighted α-fairness

نویسندگان

  • Sem C. Borst
  • Neil S. Walton
  • A. P. Zwart
چکیده

Abstract: When a communication network’s capacity increases, it is natural to want the bandwidth allocated to increase to exploit this capacity. But, if the same relative capacity increase occurs at each network resource, it is also natural to want each user to see the same relative benefit, so the bandwidth allocated to each route should remain proportional. We will be interested in bandwidth allocations which scale in this iso-elastic manner and, also, maximize a utility function. Utility optimizing bandwidth allocations have been frequently studied, and a popular choice of utility function are the weighted α-fair utility functions introduced by Mo and Walrand [17]. Because weighted α-fair utility functions possess this iso-elastic property, they are frequently used to form fluid models of bandwidth sharing networks. In this paper, we present results that show, in many settings, the only utility functions which are iso-elastic are weighted α-fair utility functions. Thus, if bandwidth is allocated according to a network utility function which scales with relative network changes then that utility function must be a weighted α-fair utility function, and hence, a control protocol that is robust to the future relative changes in network capacity and usage ought to allocate bandwidth inorder to maximize a weighted α-fair utility function.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Distributed Stateless Algorithm for α-Fair Packing Problems∗

We study weighted α-fair packing problems, that is, the problems of maximizing the objective functions (i) ∑ j wjx 1−α j /(1−α) when α > 0, α 6= 1 and (ii) ∑ j wj ln xj when α = 1, over linear constraints Ax ≤ b, x ≥ 0, where wj are positive weights and A and b are non-negative. We consider the distributed computation model that was used for packing linear programs and network utility maximizat...

متن کامل

Rate Assignment in Micro-Buffered High Speed Networks

Micro-buffered networks are high speed optical packet switched networks, and consist of either nodes with no buffering or nodes with limited buffering. We focus on the case of bufferless nodes, where there is no specific collision resolution mechanisms inside the core. Packet losses inside the core may be frequent, and are dealt with using end-to-end or edgeto-edge coding techniques. In this st...

متن کامل

Comparison of bandwidth-sharing policies in a linear network

In bandwidth-sharing networks, users of various classes require service from different subsets of shared resources simultaneously. These networks have been proposed to analyze the performance of wired and wireless networks. For general arrival and service processes, we give sufficient conditions in order to compare sample-path wise the workload and the number of users under different policies i...

متن کامل

Achieving Per-Flow Weighted Rate Fairness in a Core Stateless Network

Corelite is a Quality of Service architecture that provides weighted max-min fairness for rate among flows in a network without maintaining any per-flow state in the core routers. There are three key mechanisms that work in concert to achieve the service model of Corelite: (a) the introduction of markers in a packet flow by the edge routers to reflect the normalized rate of the flow, (b) weight...

متن کامل

Weighted deficit earliest departure first scheduling

Deficit Round Robin (DRR) and Weighted Deficit Round Robin schedulers have shown their ability in providing fair and weighted sharing of network resources for network devices. However, they are unable to provide fairness in terms of waiting time of packets among flows. We propose a new packet scheduling discipline, Weighted Deficit Earliest Departure First scheduler. It provides fairness in ter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Perform. Eval.

دوره 70  شماره 

صفحات  -

تاریخ انتشار 2013